Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes

Multiplicative programming problems (MPPs) are global optimization problems known to be NP-hard. In this paper, we employ algorithms developed to compute the entire set of nondominated points of multi-objective linear programmes (MOLPs) to solve linear MPPs. First, we improve our own objective space cut and bound algorithm for convex MPPs in the special case of linear MPPs by only solving one linear programme in each iteration, instead of two as the previous version indicates. We call this algorithm, which is based on Benson’s outer approximation algorithm for MOLPs, the primal objective space algorithm. Then, based on the dual variant of Benson’s algorithm, we propose a dual objective space algorithm for solving linear MPPs. The dual algorithm also requires solving only one linear programme in each iteration. We prove the correctness of the dual algorithm and use computational experiments comparing our algorithms to a recent global optimization algorithm for linear MPPs from the literature as well as two general global optimization solvers to demonstrate the superiority of the new algorithms in terms of computation time. Thus, we demonstrate that the use of multi-objective optimization techniques can be beneficial to solve difficult single objective global optimization problems

Delay-dependent stability of linear multi-step methods for linear neutral systems

summary:In this paper, we are concerned with numerical methods for linear neutral systems with multiple delays. For delay-dependently stable neutral systems, we ask what conditions must be imposed on linear multi-step methods in order that the numerical solutions display stability property analogous to that displayed by the exact solutions. Combining with Lagrange interpolation, linear multi-step methods can be applied to the neutral systems. Utilizing the argument principle, a sufficient condition is derived for linear multi-step methods with preserving delay-dependent stability. Numerical examples are given to illustrate the main results

Discrete representation of non-dominated sets in multi-objective linear programming

In this paper we address the problem of representing the continuous but non-convex set of nondominated points of a multi-objective linear programme by a finite subset of such points. We prove that a related decision problem is NP-complete. Moreover, we illustrate the drawbacks of the known global shooting, normal boundary intersection and normal constraint methods concerning the coverage error and uniformity level of the representation by examples. We propose a method which combines the global shooting and normal boundary intersection methods. By doing so, we overcome their limitations, but preserve their advantages. We prove that our method computes a set of evenly distributed non-dominated points for which the coverage error and the uniformity level can be guaranteed. We apply this method to an optimisation problem in radiation therapy and present illustrative results for some clinical cases. Finally, we present numerical results on randomly generated examples

DreamCraft3D: Hierarchical 3D Generation with Bootstrapped Diffusion Prior

We present DreamCraft3D, a hierarchical 3D content generation method that produces high-fidelity and coherent 3D objects. We tackle the problem by leveraging a 2D reference image to guide the stages of geometry sculpting and texture boosting. A central focus of this work is to address the consistency issue that existing works encounter. To sculpt geometries that render coherently, we perform score distillation sampling via a view-dependent diffusion model. This 3D prior, alongside several training strategies, prioritizes the geometry consistency but compromises the texture fidelity. We further propose Bootstrapped Score Distillation to specifically boost the texture. We train a personalized diffusion model, Dreambooth, on the augmented renderings of the scene, imbuing it with 3D knowledge of the scene being optimized. The score distillation from this 3D-aware diffusion prior provides view-consistent guidance for the scene. Notably, through an alternating optimization of the diffusion prior and 3D scene representation, we achieve mutually reinforcing improvements: the optimized 3D scene aids in training the scene-specific diffusion model, which offers increasingly view-consistent guidance for 3D optimization. The optimization is thus bootstrapped and leads to substantial texture boosting. With tailored 3D priors throughout the hierarchical generation, DreamCraft3D generates coherent 3D objects with photorealistic renderings, advancing the state-of-the-art in 3D content generation. Code available at https://github.com/deepseek-ai/DreamCraft3D.Comment: Project Page: https://mrtornado24.github.io/DreamCraft3D

Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning

In this paper, we propose a modification of Benson’s algorithm for solving multiobjective linear programmes in objective space in order to approximate the true nondominated set. We first summarize Benson’s original algorithm and propose some small changes to improve computational performance. We then introduce our approximation version of the algorithm, which computes an inner and an outer approximation of the nondominated set. We prove that the inner approximation provides a set of ε -nondominated points. This work is motivated by an application, the beam intensity optimization problem of radiotherapy treatment planning. This problem can be formulated as a multiobjective linear programme with three objectives. The constraint matrix of the problem relies on the calculation of dose deposited in tissue. Since this calculation is always imprecise solving the MOLP exactly is not necessary in practice. With our algorithm we solve the problem approximately within a specified accuracy in objective space. We present results on four clinical cancer cases that clearly illustrate the advantages of our method

An objective space cut and bound algorithm for convex multiplicative programmes

Multiplicative programming problems are global optimisation problems known to be NP-hard. In this paper we propose an objective space cut and bound algorithm for approximately solving convex multiplicative programming problems. This method is based on an objective space approximation algorithm for convex multi-objective programming problems. We show that this multi-objective optimisation algorithm can be changed into a cut and bound algorithm to solve convex multiplicative programming problems. We use an illustrative example to demonstrate the working of the algorithm. Computational experiments illustrate the superior performance of our algorithm compared to other methods from the literature

A dual variant of Benson’s outer approximation algorithm for multiple objective linear programming

Outcome space methods construct the set of nondominated points in the objective (outcome) space of a multiple objective linear programme. In this paper, we employ results from geometric duality theory for multiple objective linear programmes to derive a dual variant of Benson’s “outer approximation algorithm” to solve multiobjective linear programmes in objective space. We also suggest some improvements of the original version of the algorithm and prove that solving the dual provides a weight set decomposition. We compare both algorithms on small illustrative and on practically relevant examples

A heterogeneous graph convolutional attention network method for classification of autism spectrum disorder

Abstract Background Autism spectrum disorder (ASD) is a serious developmental disorder of the brain. Recently, various deep learning methods based on functional magnetic resonance imaging (fMRI) data have been developed for the classification of ASD. Among them, graph neural networks, which generalize deep neural network models to graph structured data, have shown great advantages. However, in graph neural methods, because the graphs constructed are homogeneous, the phenotype information of the subjects cannot be fully utilized. This affects the improvement of the classification performance. Methods To fully utilize the phenotype information, this paper proposes a heterogeneous graph convolutional attention network (HCAN) model to classify ASD. By combining an attention mechanism and a heterogeneous graph convolutional network, important aggregated features can be extracted in the HCAN. The model consists of a multilayer HCAN feature extractor and a multilayer perceptron (MLP) classifier. First, a heterogeneous population graph was constructed based on the fMRI and phenotypic data. Then, a multilayer HCAN is used to mine graph-based features from the heterogeneous graph. Finally, the extracted features are fed into an MLP for the final classification. Results The proposed method is assessed on the autism brain imaging data exchange (ABIDE) repository. In total, 871 subjects in the ABIDE I dataset are used for the classification task. The best classification accuracy of 82.9% is achieved. Compared to the other methods using exactly the same subjects in the literature, the proposed method achieves superior performance to the best reported result. Conclusions The proposed method can effectively integrate heterogeneous graph convolutional networks with a semantic attention mechanism so that the phenotype features of the subjects can be fully utilized. Moreover, it shows great potential in the diagnosis of brain functional disorders with fMRI data